Robustness of adiabatic quantum computation
نویسندگان
چکیده
منابع مشابه
Robustness of adiabatic quantum computation
The method of quantum computation by adiabatic evolution has been proposed as a general way of solving combinatorial search problems on a quantum computer [1]. Whereas a conventional quantum algorithm is implemented as a sequence of discrete unitary transformations that form a quantum circuit involving many energy levels of the computer, the adiabatic algorithm works by keeping the state of the...
متن کاملNeuromorphic Adiabatic Quantum Computation
Real parallel computing is possible with a quantum computer which makes use of quantum states (Nielsen & Chuang, 2000). It is well known that a quantum computation algorithm for factorization discovered by Shor (1994) is faster than any classical algorithm. Also a quantum algorithm for database search in ( ) O N quantum computation steps instead of O(N) classical steps has been proposed by Grov...
متن کاملFeedback-controlled adiabatic quantum computation
We propose a simple feedback-control scheme for adiabatic quantum computation with superconducting flux qubits. The proposed method makes use of existing on-chip hardware to monitor the ground-state curvature, which is then used to control the computation speed to maximize the success probability. We show that this scheme can provide a polynomial speed-up in performance and that it is possible ...
متن کاملQuantum Computation by Adiabatic Evolution
We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to ...
متن کاملEntanglement and Adiabatic Quantum Computation
Adiabatic quantum computation provides an alternative approach to quantum computation using a time-dependent Hamiltonian. The time evolution of entanglement during the adiabatic quantum search algorithm is studied, and its relevance as a resource is discussed. PACS Nos.: 03.67.-a, 03.67.Lx, and 03.67.Mn
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2001
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.65.012322